The subset sum problem for finite abelian groups
نویسندگان
چکیده
منابع مشابه
The sum-capture problem for abelian groups
Let G be a finite abelian group, let 0 < α < 1, and let A ⊆ G be a random set of size |G|. We let μ(A) = max B,C:|B|=|C|=|A| |{(a, b, c) ∈ A×B × C : a = b+ c}|. The issue is to determine upper bounds on μ(A) that hold with high probability over the random choice of A. Mennink and Preneel [4] conjecture that μ(A) should be close to |A| (up to possible logarithmic factors in |G|) for α ≤ 1/2 and ...
متن کاملCounting subset sums of finite abelian groups
In this paper, we obtain an explicit formula for the number of zero-sum k-element subsets in any finite abelian group.
متن کامل-sum Generators of Finite Abelian Groups
Given a finite Abelian group A and an integer t, 1 ≤ t ≤ A −1, a subset S of A is called a t-sum generator of A if every element of A can be written as the sum of exactly t distinct elements of S. In this paper we investigate the minimal integer M(t, A) such that every set S ⊆ A of size S > M(t, A) is a t-sum generator of A. The value of M(t, A) is completely determined for groups of even order.
متن کاملSubset sum problem in polycyclic groups
We consider a group-theoretic analogue of the classic subset sum problem. It is known that every virtually nilpotent group has polynomial time decidable subset sum problem. In this paper we use subgroup distortion to show that every polycyclic non-virtually-nilpotent group has NP-complete subset sum problem.
متن کاملOn the subset sum problem over finite fields
Abstract. The subset sum problem over finite fields is a well-known NPcomplete problem. It arises naturally from decoding generalized Reed-Solomon codes. In this paper, we study the number of solutions of the subset sum problem from a mathematical point of view. In several interesting cases, we obtain explicit or asymptotic formulas for the solution number. As a consequence, we obtain some resu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2013
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2012.10.006